A Framework for Consistency Algorithms

We present a framework that provides deterministic consistency algorithms for given memory models. Such an algorithm checks whether the executions of a shared-memory concurrent program are consistent under the axioms defined by a model. For memory models like SC and TSO, checking consistency is NP-complete. Our framework shows, that despite the hardness, fast deterministic consistency algorithms can be obtained by employing tools from fine-grained complexity. The framework is based on a universal consistency problem which can be instantiated by different memory models. We construct an algorithm for the problem running in time ?^*(2^k), where k is the number of write accesses in the execution that is checked for consistency. Each instance of the framework then admits an ?^*(2^k)-time consistency algorithm. By applying the framework, we obtain corresponding consistency algorithms for SC, TSO, PSO, and RMO. Moreover, we show that the obtained algorithms for SC, TSO, and PSO are optimal in the fine-grained sense: there is no consistency algorithm for these running in time 2^{o(k)} unless the exponential time hypothesis fails

Sediment pathways and the analysis of dredging on sediment deposition along the Norfolk and Lincolnshire coasts - UK

Water Qualit

Complexity of Liveness in Parameterized Systems

We investigate the fine-grained complexity of liveness verification for leader contributor systems. These consist of a designated leader thread and an arbitrary number of identical contributor threads communicating via a shared memory. The liveness verification problem asks whether there is an infinite computation of the system in which the leader reaches a final state infinitely often. Like its reachability counterpart, the problem is known to be NP-complete. Our results show that, even from a fine-grained point of view, the complexities differ only by a polynomial factor. Liveness verification decomposes into reachability and cycle detection. We present a fixed point iteration solving the latter in polynomial time. For reachability, we reconsider the two standard parameterizations. When parameterized by the number of states of the leader L and the size of the data domain D, we show an (L + D)^O(L + D)-time algorithm. It improves on a previous algorithm, thereby settling an open problem. When parameterized by the number of states of the contributor C, we reuse an O^*(2^C)-time algorithm. We show how to connect both algorithms with the cycle detection to obtain algorithms for liveness verification. The running times of the composed algorithms match those of reachability, proving that the fine-grained lower bounds for liveness verification are met

On the Complexity of Bounded Context Switching

Bounded context switching (BCS) is an under-approximate method for finding violations to safety properties in shared-memory concurrent programs. Technically, BCS is a reachability problem that is known to be NP-complete. Our contribution is a parameterized analysis of BCS. The first result is an algorithm that solves BCS when parameterized by the number of context switches (cs) and the size of the memory (m) in O*(m^(cs)2^(cs)). This is achieved by creating instances of the easier problem Shuff which we solve via fast subset convolution. We also present a lower bound for BCS of the form m^o(cs / log(cs)), based on the exponential time hypothesis. Interestingly, the gap is closely related to a conjecture that has been open since FOCS\u2707. Further, we prove that BCS admits no polynomial kernel. Next, we introduce a measure, called scheduling dimension, that captures the complexity of schedules. We study BCS parameterized by the scheduling dimension (sdim) and show that it can be solved in O*((2m)^(4sdim)4^t), where t is the number of threads. We consider variants of the problem for which we obtain (matching) upper and lower bounds

Design and characterization of superpotent bivalent ligands targeting oxytocin receptor dimers via a channel-like structure

Dimeric/oligomeric states of G-protein coupled receptors have been difficult to target. We report here bivalent ligands consisting of two identical oxytocin-mimetics that induce a three order magnitude boost in G-protein signaling of oxytocin receptors (OTRs) in vitro and a 100- and 40-fold gain in potency in vivo in the social behavior of mice and zebrafish. Through receptor mutagenesis and interference experiments with synthetic peptides mimicking transmembrane helices (TMH), we show that such superpotent behavior follows from the binding of the bivalent ligands to dimeric receptors based on a TMH1-TMH2 interface. Moreover, in this arrangement, only the analogues with a well-defined spacer length (∼25 Å) precisely fit inside a channel-like passage between the two protomers of the dimer. The newly discovered oxytocin bivalent ligands represent a powerful tool for targeting dimeric OTR in neurodevelopmental and psychiatric disorders and, in general, provide a framework to untangle specific arrangements of G-protein coupled receptor dimers

3C 220.3: a radio galaxy lensing a submillimeter galaxy

Herschel Space Observatory photometry and extensive multiwavelength followup have revealed that the powerful radio galaxy 3C 220.3 at z=0.685 acts as a gravitational lens for a background submillimeter galaxy (SMG) at z=2.221. At an observed wavelength of 1mm, the SMG is lensed into three distinct images. In the observed near infrared, these images are connected by an arc of 1.8" radius forming an Einstein half-ring centered near the radio galaxy. In visible light, only the arc is apparent. 3C 220.3 is the only known instance of strong galaxy-scale lensing by a powerful radio galaxy not located in a galaxy cluster and therefore it offers the potential to probe the dark matter content of the radio galaxy host. Lens modeling rejects a single lens, but two lenses centered on the radio galaxy host A and a companion B, separated by 1.5", provide a fit consistent with all data and reveal faint candidates for the predicted fourth and fifth images. The model does not require an extended common dark matter halo, consistent with the absence of extended bright X-ray emission on our Chandra image. The projected dark matter fractions within the Einstein radii of A (1.02") and B (0.61") are about 0.4 +/- 0.3 and 0.55 +/- 0.3. The mass to i-band light ratios of A and B, M/L ~ 8 +/- 4 Msun/Lsun, appear comparable to those of radio-quiet lensing galaxies at the same redshift in the CASTLES, LSD, and SL2S samples. The lensed SMG is extremely bright with observed f(250um) = 440mJy owing to a magnification factor mu~10. The SMG spectrum shows luminous, narrow CIV 154.9nm emission, revealing that the SMG houses a hidden quasar in addition to a violent starburst. Multicolor image reconstruction of the SMG indicates a bipolar morphology of the emitted ultraviolet (UV) light suggestive of cones through which UV light escapes a dust-enshrouded nucleus.Comment: 17 pages, 14 Figures, accepted for publication in Ap

The spin-flip phenomenon in supermassive black hole binary mergers

Massive merging black holes will be the primary sources of powerful gravitational waves at low frequency, and will permit to test general relativity with candidate galaxies close to a binary black hole merger. In this paper we identify the typical mass ratio of the two black holes but then show that the distance when gravitational radiation becomes the dominant dissipative effect (over dynamical friction) does not depend on the mass ratio. However the dynamical evolution in the gravitational wave emission regime does. For the typical range of mass ratios the final stage of the merger is preceded by a rapid precession and a subsequent spin-flip of the main black hole. This already occurs in the inspiral phase, therefore can be described analytically by post-Newtonian techniques. We then identify the radio galaxies with a super-disk as those in which the rapidly precessing jet produces effectively a powerful wind, entraining the environmental gas to produce the appearance of a thick disk. These specific galaxies are thus candidates for a merger of two black holes to happen in the astronomically near future.Comment: v3: 36 pages, 1 figure; discussion on the validity of the model and estimates for the angular value of the spin-flip added to Section 5; v4: minor changes, 2 new references, published versio

Direct Observations of the Ionizing Star in the UC HII Region G29.96-0.02: A Strong Constraint on the Stellar Birth Line for Massive Stars

We have observed the ultracompact HII region G29.96-0.02 in the near infrared J, H, and K bands and in the Br-gamma line. By comparison with radio observations, we determine that the extinction to the nebula is AK = 2.14 with a 3 sigma uncertainty of 0.25. We identify the ionizing star and determine its intrinsic K magnitude. The star does not have an infrared excess and so appears to be no longer accreting. The K magnitude and the bolometric luminosity allow us to place limits on the location of the ionizing star in the HR diagram. The 3 sigma upper limit on the effective temperature of the ionizing star is 42500 K. We favor a luminosity appropriate for star with a mass in excess of about 60 solar masses. The limit on the temperature and luminosity exclude stars on the ZAMS and stars within 10^6 yr of the ZAMS. Since the age of the UC HII region is estimated to be only about 10^5 yr, we suggest that this is direct evidence that the stellar birth line for massive stars at twice solar metallicity must be significantly redder than the ZAMS.Comment: 42 pages; LaTex; 11 Postscript figures; accepted for publication in Ap